Optimal Production Planning Models for Parallel Batch Reactors with Sequence-dependent Changeovers
نویسندگان
چکیده
Muge Erdirik-Dogan and Ignacio E. Grossmann Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213 February 2007 Abstract In this paper we address the production planning of parallel multi-product batch reactors with sequence-dependent changeovers, a challenging problem that has been motivated by a real world application of a specialty chemicals business. We propose two production planning models that anticipate the impact of the changeovers in this batch processing problem. The first model is based on underestimating the effects of the changeovers that leads to an MILP problem of moderate size. The second model incorporates sequencing constraints that yield very accurate predictions, but at the expense of a larger MILP problem. In order to solve large scale problems in terms of number of products, reactors or length of the time horizon, we propose a decomposition technique based on rolling horizon scheme and also a relaxation of the detailed planning model. Several examples are presented to illustrate the performance of the proposed models.
منابع مشابه
A slot-based formulation for the short-term scheduling of multi- stage, multi-product batch plants with resource constraints and sequence-dependent changeovers
Abstract In this paper we address the short-term scheduling of multi-product batch plants with parallel identical/nonidentical reactors, a challenging problem that has been motivated by a real world application at the Dow Chemical Company. The main challenges include handling sequence-dependent changeovers with high variance as well as two-stage production with limited, shared intermediate stor...
متن کاملSingle-Stage Scheduling of Multiproduct Batch Plants: An Edible-Oil Deodorizer Case Study
This article considers the short-term scheduling of a single-stage batch edible-oil deodorizer that can process multiple products in several product groups. Sequence-dependent changeovers occur when switching from one product group to another. Based on the incorporation of products into product groups, mixed integer linear programming (MILP) models are proposed for two scenarios, with and witho...
متن کاملGreedy Algorithm for Scheduling Batch Plants with Sequence-Dependent Changeovers
This paper presents a new algorithm for the near optimal scheduling of multistage batch plants with a large number of orders and sequence-dependent changeovers. Such problems are either intractable when solved with full-space approaches or poor solutions result. We use decomposition on the entire set of orders and derive the complete schedule in several iterations, by inserting a couple of orde...
متن کاملA Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملA New Continuous-Time Formulation for the Scheduling of Single Stage Batch Plants with Sequence Dependent Changeovers
This paper presents a new multiple-time grid, continuous-time mixed integer linear program (MILP) model for the short-term scheduling of single stage, multiproduct plants featuring equipment units with sequence dependent changeovers. It considers combined processing and changeover tasks as opposed to handling them separately and is very versatile in terms of type of objective function that can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007